Does Hard Determinism Render the Problem of Evil even Harder?

Detecting communities is Hard (And Counting Them is Even Harder)

We consider the algorithmic problem of community detection in networks. Given an undirected friendship graph G = (V, E), a subset S ⊆ V is an (α, β)-community if: • Every member of the community is friends with an α-fraction of the community; • Every non-member is friends with at most a β-fraction of the community. Arora et al [AGSS12] gave a quasi-polynomial time algorithm for enumerating all ...

the problem of divine hiddenness

این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...

Plantinga and the Logical Problem of Evil

Balancing the Budget through Social Exploitation: Why Hard Times Are Even Harder for Some.

In all societies needs and wants regularly exceed resources. Thus societies are always in deficit; demand always exceeds supply and "balancing the budget" is a constant social problem. To make matters somewhat worse, research suggests that need- and want-fulfillment tends to further stimulate the cycle of wantseeking rather than satiating desire. Societies use various resource-allocation mechan...

The ODD EVEN DELTA problem is #P-hard

Let G = (V, E) be a graph. Let k ≤ |V | be an integer. Let O k be the number of edge induced subgraphs of G having k vertices and an odd number of edges. Let E k be the number of edge induced subgraphs of G having k vertices and an even number of edges. Let ∆ k = O k − E k. The Odd Even Delta problem consists in computing ∆ k , given G and k. We show that such problem is #P-hard, even on 3-regu...